Methods Proof plan Tactic Proof
ثبت نشده
چکیده
منابع مشابه
Generalization and Reuse of Tactic
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering ...
متن کاملLearning to Reason with HOL4 tactics
Techniques combining machine learning with translation to automated reasoning have recently become an important component of formal proof assistants. Such “hammer” techniques complement traditional proof assistant automation as implemented by tactics and decision procedures. In this paper we present a unified proof assistant automation approach which attempts to automate the selection of approp...
متن کاملGeneralization and Reuse of Tactic Proofs
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering ...
متن کاملPDS — A Three-Dimensional Data Structure for Proof Plans
We present a new data structure that enables to store three-dimensional proof objects in a proof development environment. The aim is to handle calculus level proofs as well as abstract proof plans together with information of their correspondences in a single structure. This enables not only different means of the proof development environment (e.g., ruleand tactic-based theorem proving, or pro...
متن کاملComparing Interactive and Automated Proof: A Knowledge-modelling Approach
assess Judgement refine strategy Plan refineactionTactic SequenceapplyCurrent GoalProofjoinselectActionFigure 3. Inference structureThe Current Goal is the goal to be proven as it is repre-sented at the prover interface. At the start of problem solvingthe instance of Current Goal is:!P. P[] /\ (!x. P[x] /\ (!l1 l2. P l1 /\ P l2 ==>P(APPEND...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002